电视机监督检验电磁兼容结果分析和对策

本文讨论了电磁兼容对电视机的技术要求和相应对策。     

提高水平集方法初始化计算速度的研究

本文对水平集方法的初始化步骤进行了改进。在水平集方法中，初始化是一个很重要的步骤。它包括计算图像平面中每个点的初始水平集距离，同时找到与当前点距离最近的曲线上的点。这是一个费时的过程，影响到整个水个集方法的计算速度。本文基于快速推进法提出了一种快速初始化方法。这种方法只需要Ｏ（Ｎ）的时间就能够遍历所有的图像点，完成初始化。最后，对三种不同的初始化方法：直接法、快速推进法和本文的方法在计算速度上作了对比。实验表明，最终得到理想的分割结果的情况下，本文的方法在时间上优于其他两种方法。     

三峡地下电站变顶高尾水洞水动力特性

在国内首次应用模型水轮发电机组对三峡地下电站变顶高尾水洞方案进行水力过渡过程试验研究。对水轮机导叶实行分段关闭 ,并求出了二段关闭的最佳拐点 ,试验证实了二段关闭对减小尾水管进口的负压和机组转速上升有明显的作用。通过有关水力参数的测试 ,认为变顶高尾水洞可以满足各项技术要求 ,是一个减少山体开挖、节省投资的新型设计方案。在地下电站中具有广泛的应用前景     

利用DAC设计数控信号发生器

利用数模转换器可构成频率精度高并且可程控的信号发生器。本电路主要由计数器CD4029产生稳定的八路数字信号输出，经数模转换器AD7528输出模拟信号，再经运放变换，从电路的不同的输出端分别实现了三角波、矩形波、正弦波输出，从而实现了信号发生器的数字控制。     

合成氨扩能改造中锅炉存在的问题及采取的措施

针对天脊集团年产30万t合成氨扩能改造,给2台225t/h高压锅炉带来的除氧器热量过剩、锅炉给水温度升高、主蒸汽温度降低等一系列问题,分析了产生问题的原因,从节约能源、提高锅炉效率考虑,提出了相应的解决问题的办法:利用热量分流、改造省煤器管、增加二级过热器受热面积。经过3年多的生产实践证明,取得了良好的效果。     

三峡水电站ALSTOM机组低水头运行稳定性分析

混流式水轮机的水力稳定性与机组水力工况密切相关。以三峡电站左岸6号机组稳定性试验为例，分析了ALSTOM机组的低水头运行稳定性。根据试验分析结果，可将机组运行工况划分为小负荷区、涡带振动区、大负荷运行区。小负荷区机组效率较低，机组不宜在此区间运行；大负荷区机组运行稳定性最佳，但机组应避开强涡带工况区和特殊频率振动区运行。     

The solution of the inverse problem of gravitational potential using a set of measurements of different field elements

A numerical solution of the inverse problem of the gravitational field at a single point is obtained using six field elements for a point, a spherical cap, a differential spherical sector and a vertical segment. In the system of six equations obtained, the unknowns are the mass of the body, the depth of its center, and the second, third, and fourth degree moments. The accuracy of the solution of this system is ten times higher than when using three field elements. __________ Translated from Izmeritel’naya Tekhnika, No. 5, pp. 3–8, May, 2007.     

RanGen: A Random Network Generator for Activity-on-the-Node Networks

In this paper, we describe RanGen, a random network generator for generating activity-on-the-node networks and accompanying data for different classes of project scheduling problems. The objective is to construct random networks which satisfy preset values of the parameters used to control the hardness of a problem instance. Both parameters which are related to the network topology and resource-related parameters are implemented. The network generator meets the shortcomings of former network generators since it employs a wide range of different parameters which have been shown to serve as possible predictors of the hardness of different project scheduling problems. Some of them have been implemented in former network generators while others have not.     

A new distributed approximation algorithm for constructing minimum connected dominating set in wireless ad hoc networks

In recent years, constructing a virtual backbone by nodes in a connected dominating set (CDS) has been proposed to improve the performance of ad hoc wireless networks. In general, a dominating set satisfies that every vertex in the graph is either in the set or adjacent to a vertex in the set. A CDS is a dominating set that also induces a connected sub‐graph. However, finding the minimum connected dominating set (MCDS) is a well‐known NP‐hard problem in graph theory. Approximation algorithms for MCDS have been proposed in the literature. Most of these algorithms suffer from a poor approximation ratio, and from high time complexity and message complexity. In this paper, we present a new distributed approximation algorithm that constructs a MCDS for wireless ad hoc networks based on a maximal independent set (MIS). Our algorithm, which is fully localized, has a constant approximation ratio, and O(n) time and O(n) message complexity. In this algorithm, each node only requires the knowledge of its one‐hop neighbours and there is only one shortest path connecting two dominators that are at most three hops away. We not only give theoretical performance analysis for our algorithm, but also conduct extensive simulation to compare our algorithm with other algorithms in the literature. Simulation results and theoretical analysis show that our algorithm has better efficiency and performance than others. Copyright © 2005 John Wiley & Sons, Ltd.     

Probabilistic output admissible set for systems with time-varying uncertainties

This paper considers time-varying uncertain constrained systems, and develops a method for computing a probabilistic output admissible (POA) set. This set consists of the initial states probabilistically assured to satisfy the constraint. The time-invariant counterpart has already been investigated in Hatanaka and Takaba [Computations of probabilistic output admissible set for uncertain constrained systems, Automatica 44 (2) (2008), to appear]. We first define the POA set for time-varying uncertainties with finite dimensional probability space. Then, we show that an algorithm similar to Hatanaka and Takaba [Computations of probabilistic output admissible set for uncertain constrained systems, Automatica 44 (2) (2008), to appear] provides the POA set also in the time-varying case, as long as an upper bound of a what we call future output admissibility (FOA) index is available. We moreover present two methods for computing the upper bound of the FOA index: probabilistic and deterministic methods. A numerical simulation demonstrates the effectiveness of our algorithm.